Incremental generation of parsers

Incremental Generation of LR Parsers

Implementation of a new compiler usually requires making frequent adjustments to grammar de nitions. An incremental technique for updating the parser tables after a minor change to the grammar could potentially save much computational e ort. More importantly, debugging a grammar is made easier if the grammar is re-checked for correctness after each small change to the grammar. The basic design ...

Efficient Implementation of Beam-Search Incremental Parsers

Beam search incremental parsers are accurate, but not as fast as they could be. We demonstrate that, contrary to popular belief, most current implementations of beam parsers in fact run in O(n2), rather than linear time, because each statetransition is actually implemented as an O(n) operation. We present an improved implementation, based on Tree Structured Stack (TSS), in which a transition is...

Yet Another Generation of LALR Parsers

Efficiency considerations for LFG-parsers - incremental and table-lookup techniques

I s tv£n B£tori and Stefan Marok FB 2 Linguis t ics E W H Rhein land-Pfa lz , l~heinun 3-4, D-5400 Koblenz~ F R G The paper presents a concise description of the LFG-ParserGenerator developed at the EWH in Koblenz. Special attention is paid to efficiency considerations to speed up the system in the execution phase. Lexicon is separated, ll(k)-parsing tables are used and some preliminary ratific...

Incremental Generation by Incremental Parsing

The paper shows how an incremental generator can be constructed based on the incremental parsing framework described in Dynamic Syntax (DS)(Kempson et al., 2001), without adding a generator-specific vocabulary or intermediate levels of representation. The resulting generator is defined purely in terms of the parsing process, together with a notion of tree subsumption. This is shown to have vari...